Abstract key polynomials and comparison theorems with the key polynomials of Mac Lane–Vaquié

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conference Key Establishment Using Polynomials

In 1992, Blundo et al. have proposed a non-interactive k-secure m-conference protocol based on an m-variate polynomial over a finite field Fp. The key distribution center (KDC) is responsible to pick a symmetric m-variate polynomial of degree k and generate shares for users. Each share is a symmetric polynomial involving m− 1 variables of degree k, and needs to store the coefficients of such a ...

متن کامل

Notes on Schubert, Grothendieck and Key Polynomials

We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco–Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial properties of the reduced rectangular plactic algebra and associated Cauchy kernels.

متن کامل

Semistandard tableaux for Demazure characters (key polynomials) and their atoms

The Schur function indexed by a partition λ with at most n parts is the sum of the weight monomials for the Young tableaux of shape λ. Let π be an npermutation. We give two descriptions of the tableaux that contribute their monomials to the key polynomial indexed by π and λ. (These polynomials are the characters of the Demazure modules for GL(n).) The “atom” indexed by π is the sum of weight mo...

متن کامل

Security of public key cryptosystems based on Chebyshev Polynomials

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and ...

متن کامل

Explicit theorems on generator polynomials

Progress over the past decade is surveyed concerning explicit existence and construction theorems on irreducible, primitive and normal polynomials. © 2005 Elsevier Inc. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Illinois Journal of Mathematics

سال: 2018

ISSN: 0019-2082

DOI: 10.1215/ijm/1552442662